NP-complete problems

Results: 1536



#Item
881NP-complete problems / Operations research / Travelling salesman problem / Vehicle routing problem / Routing / Algorithm / Workforce management / Mathematics / Theoretical computer science / Applied mathematics

OPTURION Righting the Wrongs of Transport Optimisation Professor Mark Wallace, October 2014

Add to Reading List

Source URL: www.opturion.com

Language: English - Date: 2014-10-14 22:21:10
882Theoretical computer science / NP-complete problems / Cybernetics / Genetic algorithm / Mathematical optimization / Travelling salesman problem / Simulated annealing / Algorithm / Route assignment / Mathematics / Applied mathematics / Operations research

22nd Australasian Transport Research Forum Sydney, September 1998 A comparison of different methods for selecting and schednling transport investments Vivian Salim

Add to Reading List

Source URL: www.atrf.info

Language: English - Date: 2012-01-03 17:54:49
883Graph / Neighbourhood / Adjacency matrix / Line graph / Directed acyclic graph / Hamiltonian path / Eulerian path / Tree / Independent set / Graph theory / Mathematics / NP-complete problems

Sage Reference Manual: Graph Theory Release 6.6.beta0 The Sage Development Team February 21, 2015

Add to Reading List

Source URL: sagemath.org

Language: English - Date: 2015-02-21 07:35:21
884Propositional calculus / Automated theorem proving / Mathematical logic / Logic in computer science / NP-complete problems / Conjunctive normal form / Boolean satisfiability problem / Resolution / Unit propagation / Theoretical computer science / Logic / Mathematics

Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3

Add to Reading List

Source URL: www.st.ewi.tudelft.nl

Language: English - Date: 2011-06-03 17:52:43
885Graph partition / Graph / Graph coloring / Path decomposition / Graph theory / Theoretical computer science / NP-complete problems

UNIVERSITÉ DE BORDEAUX I LABORATOIRE BORDELAIS DE RECHERCHE EN INFORMATIQUE HABILITATION À DIRIGER DES RECHERCHES AU TITRE DE L’ÉCOLE DOCTORALE DE MATHÉMATIQUES ET D’INFORMATIQUE

Add to Reading List

Source URL: www.labri.fr

Language: English - Date: 2010-11-27 17:55:14
886NP-complete problems / Logic in computer science / Electronic design automation / Formal methods / Automated theorem proving / Boolean satisfiability problem / Conjunctive normal form / Search algorithm / Unit propagation / Theoretical computer science / Applied mathematics / Mathematics

EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2

Add to Reading List

Source URL: www.st.ewi.tudelft.nl

Language: English - Date: 2011-09-26 11:40:39
887NP-complete problems / Conjunctive normal form / Automated theorem proving / Boolean satisfiability problem / Resolution / Theoretical computer science / Mathematics / Applied mathematics

Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2

Add to Reading List

Source URL: www.st.ewi.tudelft.nl

Language: English - Date: 2009-12-21 10:55:55
888Boolean algebra / Symmetry / Logic in computer science / NP-complete problems / Electronic design automation / Boolean satisfiability problem / True quantified Boolean formula / Conjunctive normal form / Symmetry in mathematics / Theoretical computer science / Mathematics / Applied mathematics

Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2014-01-02 11:31:27
889Graph coloring / NP-complete problems / Complexity classes / Boolean satisfiability problem / SL / 2-satisfiability / Greedy coloring / Theoretical computer science / Graph theory / Mathematics

Dynamic Symmetry Breaking by Simulating Zykov Contraction Bas Schaafsma, Marijn Heule! and Hans van Maaren Department of Software Technology, Delft University of Technology [removed], [removed], h.van

Add to Reading List

Source URL: www.st.ewi.tudelft.nl

Language: English - Date: 2009-04-21 07:17:46
890NP-complete problems / Shortest path problem / Graph / Tree / Graph coloring / Path decomposition / Graph theory / Theoretical computer science / Mathematics

PT-Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest

Add to Reading List

Source URL: gforge.inria.fr

Language: English
UPDATE